A Cheeger inequality of a distance regular graph using Green’s function
نویسندگان
چکیده
منابع مشابه
A Cheeger Inequality for the Graph Connection Laplacian
The O(d) Synchronization problem consists of estimating a set of unknown orthogonal transformations Oi from noisy measurements of a subset of the pairwise ratios OiO −1 j . We formulate and prove a Cheegertype inequality that relates a measure of how well it is possible to solve the O(d) synchronization problem with the spectra of an operator, the graph Connection Laplacian. We also show how th...
متن کاملA Linear Cheeger Inequality using Eigenvector Norms
The Cheeger constant, hG, is a measure of expansion within a graph. The classical Cheeger Inequality states: λ1/2 ≤ hG ≤ √ 2λ1 where λ1 is the first nontrivial eigenvalue of the normalized Laplacian matrix. Hence, hG is tightly controlled by λ1 to within a quadratic factor. We give an alternative Cheeger Inequality where we consider the∞-norm of the corresponding eigenvector in addition to λ1. ...
متن کاملA Generalized Cheeger Inequality
where capG(S, S̄) is the total weight of the edges crossing from S to S̄ = V − S. We show that the minimum generalized eigenvalue λ(LG, LH) of the pair of Laplacians LG and LH satisfies λ(LG, LH) ≥ φ(G,H)φ(G)/8, where φ(G) is the usual conductance of G. A generalized cut that meets this bound can be obtained from the generalized eigenvector corresponding to λ(LG, LH). The inequality complements a...
متن کاملA Questionable Distance-Regular Graph
In this paper, we introduce distance-regular graphs and develop the intersection algebra for these graphs which is based upon its intersection numbers. We discuss results following from the definition of the intersection algebra. We investigate two examples of distance-regular graphs and show how these results apply. Finally, we introduce parameters that determine intersection numbers. We inves...
متن کاملSubgraphs Graph in a Distance-regular Graph
Let Γ denote a D-bounded distance-regular graph, where D ≥ 3 is the diameter of Γ. For 0 ≤ s ≤ D − 3 and a weak-geodetically closed subgraph ∆ of Γ with diameter s, define a graph G(∆) whose vertex set is the collection of all weak-geodetically closed subgraphs of diameter s+2 containing ∆, and vertex Ω is adjacent to vertex Ω′ in G if and only if Ω∩Ω′ as a subgraph of Γ has diameter s+1. We sh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2013
ISSN: 0012-365X
DOI: 10.1016/j.disc.2013.06.012